NP Satisfiability for Arrays as Powers
نویسندگان
چکیده
We show that the satisfiability problem for quantifier-free theory of product structures with equicardinality relation is in NP. As an application, we extend combinatory array logic fragment to handle cardinality constraints. The resulting independent base element and index set theories.
منابع مشابه
A simplified NP-complete satisfiability problem
Cook [l] has shown that 3-SAT, the Boolean satisfiability problem restricted to instances with exactly three variables per clause, is NP-complete. This is a tightest possible restriction on the number of variables in a clause because as Even et al. [2] demonstrate, 2-SAT is in P. Horowitz and Sahni [5] point up the importance of finding the strongest possible restrictions under which a problem ...
متن کاملThe k-Satisfiability problem remains NP-complete for dense families
We consider the ~ATISFIABILITY problem (~-SAT): Given a family F of n clauses cl, ._, , c, in conjunctive normal form, each consisting of k literals corresponding to k different variables of a set of r 2 k 2 1 boolean variables, is F satisfiable? By k-SAT@ no) we denote the k-SAT problem restricted to families with n > n,(r) clauses. We prove that for each k > 3 and each integer I > 4 such that...
متن کاملFirst-order satisfiability in Gödel logics: An NP-complete fragment
Defined over sets of truth values V which are closed subsets of [0, 1] containing both 0 and 1, Gödel logics GV are prominent examples of many-valued logics. We investigate a first-order fragment of GV extended with ∆ that is powerful enough to formalize important properties of fuzzy rule-based systems. The satisfiability problem in this fragment is shown to be NP-complete for all GV , also in ...
متن کاملAnalysing powers for the reaction np → pp π − and for np elastic scattering from 270 to 570 MeV
The analysing power of the reaction np → ppπ − for neutron energies between threshold and 570 MeV has been determined using a transversely polarised neutron beam at PSI. The reaction has been studied in a kinematically complete measurement using a time-of-flight spectrometer with large acceptance. Analysing powers have been determined as a function of the c.m. pion angle in different regions of...
متن کاملSpace-Time Assumptions Behind NP-Hardness of Propositional Satisfiability
For some problems, we know feasible algorithms for solving them. Other computational problems (such as propositional satisfiability) are known to be NP-hard, which means that, unless P=NP (which most computer scientists believe to be impossible), no feasible algorithm is possible for solving all possible instances of the corresponding problem. Most usual proofs of NP-hardness, however, use Turi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Lecture Notes in Computer Science
سال: 2022
ISSN: ['1611-3349', '0302-9743']
DOI: https://doi.org/10.1007/978-3-030-94583-1_15